Subspace Subcodes of Reed-Solomon Codes

نویسندگان

  • Masayuki Hattori
  • Robert J. McEliece
  • Gustave Solomon
چکیده

space subcode of a Reed-Solomon (SSRS) code Over GF(2"') is the set of RS codewords, whose components all lie in a particular GF(2)subspace of GF(2"). SSRS codes include both generalized B C H codes and "trace-shortened" Rs codes [2][3] as special casea. In this paper we present an explicit formula for t h e dimension of an arbitrary RS subspace subcode. Using this formula, we And that in many cases, SSRS codes are competetive with algebraic geometry codes, and that in some cnsea, the dimension of the best subspace subcode is larger than that of the corresponding GBCH code.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized subspace subcodes with application in cryptology

Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode method, which leads to Alternant codes and Goppa codes over the underlying prime field, or over some intermediate subfield. The main advantages of these constr...

متن کامل

Properties of subspace subcodes of optimum codes in rank metric

Maximum rank distance codes denoted MRD-codes are the equivalent in rank metric of MDS-codes. Given any integer $q$ power of a prime and any integer $n$ there is a family of MRD-codes of length $n$ over $\FF{q^n}$ having polynomial-time decoding algorithms. These codes can be seen as the analogs of Reed-Solomon codes (hereafter denoted RS-codes) for rank metric. In this paper their subspace sub...

متن کامل

A Linear Algebraic Approach to Subfield Subcodes of GRS Codes

The problem of finding subfield subcodes of generalized Reed–Solomon (GRS) codes (i.e., alternant codes) is considered. A pure linear algebraic approach is taken in order to derive message constraints that generalize the well known conjugacy constraints for cyclic GRS codes and their Bose– Chaudhuri–Hocquenghem (BCH) subfield subcodes. It is shown that the presented technique can be used for fi...

متن کامل

The dimension of subcode-subfields of shortened generalized Reed-Solomon codes

Reed-Solomon (RS) codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures. However, RS codes suffer from having a fixed length. In many applications where the length is static, the appropriate length can be obtained by an RS code by shortening or puncturing. Generalized Reed-Solomon (GRS) codes are a generalization of RS codes...

متن کامل

Fq-Linear Cyclic Codes over Fq: DFT Characterization

Codes over Fqm that form vector spaces over Fq are called Fq-linear codes over Fqm . Among these we consider only cyclic codes and call them Fq-linear cyclic codes (FqLC codes) over Fqm . This class of codes includes as special cases (i) group cyclic codes over elementary abelian groups (q = p, a prime), (ii) subspace subcodes of Reed-Solomon codes and (iii) linear cyclic codes over Fq (m=1). T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 44  شماره 

صفحات  -

تاریخ انتشار 1998